Profit Maximization in Flex-Grid All-Optical Networks
نویسندگان
چکیده
منابع مشابه
Profit Maximization in Flex-Grid All-Optical Networks
All-optical networks have been largely investigated due to their high data transmission rates. The key to the high speeds in alloptical networks is to maintain the signal in optical form, to avoid the overhead of conversion to and from electrical form at the intermediate nodes. In the traditional WDM technology the spectrum of light that can be transmitted through the optical fiber has been div...
متن کاملGMPLS control plane extensions in support of flex-grid enabled elastic optical networks
We develop a GMPLS control plane handling flex-grid enabled Elastic Optical Networks. The implementation is realized in OPNET Modeler event driven simulation tool with focus on developing and implementing extensions for the GMPLS protocol suite. RSVP-TE extensions address the reservation of generalized labels format and enable enhancements for the wavelength selection procedures. OSPF-TE enable...
متن کاملFlex-grid optical networks: spectrum allocation and nonlinear dynamics of super-channels.
Flex-grid optical networks have evolved as a near-future deployment option to facilitate dynamic and bandwidth intense traffic demands. These networks enable capacity gains by operating on a flexible spectrum, allocating minimum required bandwidth, for a given channel configuration. It is thus important to understand the nonlinear dynamics of various high bit-rate super-channel configurations, ...
متن کاملProfit Maximization in Cloud Computing
Cloud computing is a novel paradigm for the provision of computing infrastructure, which aims to shift the location of the computing infrastructure to the network in order to reduce the costs of management and maintenance of hardware and software resources. To maximize the profit, a service provider should understand both service charges and business costs. Our pricing model takes such factors ...
متن کاملImplicit Flow Maximization on Grid Networks
The implicit flow maximization algorithm of Sawitzki [2] computes a maximum flow on an implicitly given 0–1 network, represented by OBDDs. If the maximum flow value is constant w. r. t. the network size, the algorithm performs O ( log |V | ) OBDD-operations. This is the case for (2k + 1) × (2k + 1)-grid networks, whose maximum flow value is 2. It is shown that all OBDDs which are generated duri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09943-x